Relaxed Gabriel Graphs
نویسندگان
چکیده
We study a new family of geometric graphs that interpolate between the Delaunay triangulation and the Gabriel graph. These graphs share many properties with βskeletons for β ∈ [0, 1] (such as sublinear spanning ratio) with the added benefit of planarity (and consequently linear size and local routability).
منابع مشابه
Hardness Results for Computing Optimal Locally Gabriel Graphs
Delaunay and Gabriel graphs are widely studied geometric proximity structures. Motivated by applications in wireless routing, relaxed versions of these graphs known as Locally Delaunay Graphs (LDGs) and Locally Gabriel Graphs (LGGs) have been proposed. We propose another generalization of LGGs called Generalized Locally Gabriel Graphs (GLGGs) in the context when certain edges are forbidden in t...
متن کاملOn Computing Optimal Locally Gabriel Graphs
Delaunay and Gabriel graphs are widely studied geometric proximity structures. Motivated by applications in wireless routing, relaxed versions of these graphs known as Locally Delaunay Graphs (LDGs) and Locally Gabriel Graphs (LGGs) were proposed. We propose another generalization of LGGs called Generalized Locally Gabriel Graphs (GLGGs) in the context when certain edges are forbidden in the gr...
متن کاملOn the edge-connectivity of C_4-free graphs
Let $G$ be a connected graph of order $n$ and minimum degree $delta(G)$.The edge-connectivity $lambda(G)$ of $G$ is the minimum numberof edges whose removal renders $G$ disconnected. It is well-known that$lambda(G) leq delta(G)$,and if $lambda(G)=delta(G)$, then$G$ is said to be maximally edge-connected. A classical resultby Chartrand gives the sufficient condition $delta(G) geq frac{n-1}{2}$fo...
متن کاملOn the Expected Maximum Degree of Gabriel and Yao Graphs
Motivated by applications of Gabriel graphs andYao graphs in wireless ad-hoc networks, we show that the maximum degree of a random Gabriel graph or Yao graph defined on n points drawn uniformly at random from a unit square grows as (log n/ log log n) in probability.
متن کاملHandling Numeric Criteria in Relaxed Planning Graphs
Nowadays, one of the main techniques used in heuristic planning is the generation of a relaxed planning graph, based on a Graphplan-like expansion. Planners like FF or MIPS use this type of graphs in order to compute distance-based heuristics during the planning process. This paper presents a new approach to extend the functionality of these graphs in order to manage numeric optimization criter...
متن کامل